The Time-Dependent Vehicle Routing Problem with Time Windows and Road-Network Information

Most time-dependent vehicle routing problems are based on a similar modeling paradigm: travel time information is represented by functions between pairs of points interest (e.g., depot or customers). Only few papers investigate how these can be computed using the available information. Furthermore, most them neglect possibility that different paths could selected in road network depending compromises they offer cost (distance) and time. In this paper, we propose new setting where defined road-network arcs. We consider Time-Dependent Vehicle Routing Problem with Time Windows solve it branch-and-price algorithm. As far as know, first exact approach for problem when initially segments road-network.